#define _CRT_SECURE_NO_WARNINGS 1


#include"BinarySearchTree.h"

int main()
{
	int arr[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	BSTree<int> bst1;
	for (auto& e : arr)
	{
		bst1.insert(e);
	}

	bst1.InOrder();

	bst1.Erase(8);
	bst1.InOrder();

	for (auto& e : arr)
	{
		bst1.Erase(e);
		bst1.InOrder();
	}

	return 0;
}